Derivative-free methods for nonlinear programming with general lower-level constraints*
نویسندگان
چکیده
Augmented Lagrangian methods for derivative-free continuous optimization with constraints are introduced in this paper. The algorithms inherit the convergence results obtained by Andreani, Birgin, Martínez and Schuverdt for the case in which analytic derivatives exist and are available. In particular, feasible limit points satisfy KKT conditions under the Constant Positive Linear Dependence (CPLD) constraint qualification. The form of our main algorithm allows us to employ well established derivative-free subalgorithms for solving lower-level constrained subproblems. Numerical experiments are presented. Mathematical subject classification: 90C30, 90C56.
منابع مشابه
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
A trust-funnel method is proposed for solving nonlinear optimization problems with general nonlinear constraints. It extends the one presented by Gould and Toint (Math. Prog., 122(1):155196, 2010), originally proposed for equality-constrained optimization problems only, to problems with both equality and inequality constraints and where simple bounds are also considered. As the original one, ou...
متن کاملStudy on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
متن کاملA trust-funnel method for nonlinear optimization problems with general nonlinear constraints and its application to derivative-free optimization
A trust-funnel method is proposed for solving nonlinear optimization problems with general nonlinear constraints. It extends the one presented by Gould and Toint (Math. Prog., 122(1):155196, 2010), originally proposed for equality-constrained optimization problems only, to problems with both equality and inequality constraints and where simple bounds are also considered. As the original one, ou...
متن کاملSequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
We consider the problem of minimizing a continuously differentiable function of several variables subject to smooth nonlinear constraints. We assume that the first order derivatives of the objective function and of the constraints can be neither calculated nor approximated explicitly. Hence, every minimization procedure must use only a suitable sampling of the problem functions. These problems ...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کامل